Patent evaluation method and system that aggregate patents based on technical clustering

ABSTRACT

A patent evaluation method and system thereof are provided. The method includes collecting patent documents, and further includes the following steps: generating technical points and patent-affiliated technical points; generating technical clusters and patent-affiliated cluster; performing a patent evaluation in each of the technical clusters. The patent evaluation method and system proposed in the present invention aggregates the patents in a technical cluster mode through natural language processing and complex network algorithms, gives patents scientific and technological attributes, and places the patents in a global same industry for evaluation.

CROSS REFERENCE TO THE RELATED APPLICATIONS

This application is continuation application of International Application No. PCT/CN2020/073106, filed on Jan. 20, 2020, which is based upon and claims priority to Chinese Patent Application No. 201910075167.7, filed on Jan. 25, 2019, the entire contents of which are incorporated herein by reference.

TECHNICAL FIELD

The invention relates to the technical field of network monitoring, in particular to a patent evaluation method and system.

BACKGROUND

With the increasing development of science and technology, companies are paying more and more attention to their own intellectual property protection, and the number and quality of patent applications have also been greatly increased, at this stage, several patent management platforms have been developed, but these patent management platforms are only applicable to the payment period of patents and the current review stage and cannot evaluate value of patents.

It is well known that accurate and effective value evaluation of existing patent documents can guide the development work of technical personnel and shorten the development time of the project, therefore, it is very promising to develop a patent evaluation system for technical personnel to use.

The invention patent with publication number CN 103164540A discloses a patent hot spot discovery and trend analysis method. During the patent hot spot discovery, first, word segmentation is executed, and a similarity between patent documents is calculated, and clustering is executed based on the similarity. Then, phrases in each cluster are merged to make the result more concise and intuitive. Then, a hot spot technology is discovered through a hot spot calculation method, and hot spot degree of each hot spot technology is analyzed. Finally, curve fitting is executed according to historical data, and a current life cycle of a certain technology is judged by means of Logistic regression curve, so as to analyze development status and potential research value of the technology. At the same time, an effective trend analysis of a hot technology is executed to give the future development trend of this technology. The disadvantage of this method is that it only evaluates patents from technical hot pots and has a single dimension, which makes it difficult to reflect the value of patents in other aspects.

SUMMARY

In order to solve the above-mentioned technical problems, the present invention proposes a patent evaluation method and system, which aggregates the patents in a technical cluster mode through natural language processing and complex network algorithms, gives patents scientific and technological attributes, and places the patents in a global same industry for evaluation.

The first object of the present invention is to provide a patent evaluation method, including collecting patent documents, and further including the following steps:

-   -   step 1: generating technical points and patent-affiliated         technical points;     -   step 2: generating technical clusters and patent-affiliated         clusters;     -   step 3: performing a patent evaluation in each of the technical         clusters.

Preferably, the step 1 includes the following sub-steps:

-   -   step 11: constructing a collection of patent documents;     -   step 12: generating lexical items of each patent;     -   step 13: summarizing the lexical items and calculating a word         vector of each of the lexical items;     -   step 14: determining a word vector of a node in an existing         knowledge graph according to word vectors, and calculating a         similarity between connected word vectors to generate an         undirected weighted graph G;     -   step 15: using spectral clustering to generate clusters which         are the technical points according to the undirected weighted         graph G;     -   step 16: calculating an average word vector of each technical         point according to the lexical items and the word vectors;     -   step 17: selecting the most frequent T numbers of lexical items         from the lexical items as patent keywords, and using the word         vectors to calculate an average word vector of each patent         keyword;     -   step 18: calculating a cosine similarity between the average         word vector of the technical point and the average word vector         of the patent keyword.

In any of the above solutions, preferably, an implementation method of the step 12 is to define the collection of patent documents as C={C₁, C₂, . . . , C_(n)}, any patent Ci in the collection of patent documents C is represented by a space vector of a set of keywords.

In any of the above solutions, preferably, a process of the implementation method is to first use an existing word segmentation system to perform Chinese word segmentation on all the patent documents to obtain the lexical items; and then to remove stop words in the patent documents according to a custom or public stop word database, wherein the stop words are function words without actual meanings.

In any of the above solutions, preferably, an implementation method of the step 13 is to predict an occurrence probability of a current word according to words in context, and a learning goal is to maximize a log-likelihood function,

$L = {\sum\limits_{\omega \in C}{\log\;{p\left( \omega \middle| {{Context}\;(\omega)} \right)}}}$ wherein ω represents any word in the patent documents C, p represents probability, p(ω|Context(ω)) represents probability under the Context(ω), and Context represents a context of the word.

In any of the above solutions, preferably, an iteration formula of the word vector of each word is as follows:

${{v\left( \overset{\sim}{\omega} \right)}:={{v\left( \overset{\sim}{\omega} \right)} + {\eta{\sum\limits_{j = 2}^{l^{\omega}}\frac{\partial{L\left( {\omega,j} \right)}}{\partial x_{\omega}}}}}},{\overset{\sim}{\omega} \in {{Context}(\omega)}}$ wherein x represents a word vector added by all of the word vectors of the word in the context, η represents a learning rate, l^(ω) represents the number of nodes, ∂ represents a partial derivative, x_(ω represents an input of an input layer.)

${{v\left( \overset{\sim}{\omega} \right)}:={{v\left( \overset{\sim}{\omega} \right)} + {\eta{\sum\limits_{j = 2}^{l^{\omega}}\frac{\partial{L\left( {\omega,j} \right)}}{\partial x_{\omega}}}}}},{\overset{\sim}{\omega} \in {{Context}\mspace{11mu}(\omega)}}$

In any of the above solutions, preferably, the step 14 further comprises calculating a cosine similarity between connected nodes.

In any of the above solutions, preferably, a calculation formula of the cosine similarity is

${\cos(\theta)} = \frac{\sum_{i = 1}^{n}\left( {x_{i} \times y_{i}} \right)}{\sqrt{\sum_{i = 1}^{n}\left( x_{i} \right)^{2}} \times \sqrt{\sum_{i = 1}^{n}\left( y_{i} \right)^{2}}}$ wherein x_(i), y_(i) are the i-th element of the word vectors respectively, and n is a dimension of the word vector.

In any of the above solutions, preferably, a calculation method of the technical points is as follows:

-   -   step 151: generating an adjacency matrix W of the graph G, where         W is a symmetric matrix, and diagonal elements are 0;     -   step 152: normalizing to generate a Laplacian matrix;     -   step 153: generating the smallest k eigenvalues and         corresponding eigenvectors of L;     -   step 154: taking each row of the eigenvectors as a sample point,         and clustering the sample point by using the k-means method to         obtain cluster divisions.

In any of the above solutions, preferably, the Laplacian matrix L=D−W satisfies

$L_{ij} = \left\{ \begin{matrix} {\sum\limits_{j = 1}^{n}\omega_{ij}} & {i = j} \\ {- \omega_{ij}} & {i \neq j} \end{matrix} \right.$ wherein D is a diagonal matrix whose diagonal elements d_(i) are a sum of elements of W rows or columns, L_(ij) is an element in L, ω_(ij) is an element in W.

In any of the above solutions, preferably, the step 2 comprises the following sub-steps:

-   -   step 21: counting the number of patents in common between any         two technical points;     -   step 22: generating a complex network by taking the technical         point as a point and the number of patents in common as an edge;     -   step 23: generating the technical clusters.

In any of the above solutions, preferably, the step 3 comprises the following sub-steps:

-   -   step 31: segmenting each patent text in the clusters and         removing the stop words;     -   step 32: generating the word vectors of each patent;     -   step 33: using the cosine similarity to calculate a similarity         between any two patents in the clusters;     -   step 34: generating a complex network by taking the patent as a         point and the similarity as an edge;     -   step 35: calculating a TextRank value of each patent.

In any of the above solutions, preferably, the step 32 comprises the following sub-steps:

-   -   step 321: generating lexical items of each patent;     -   step 322: summarizing the lexical items, and calculating the         word vector of each lexical item;     -   step 323: introducing patent documents id into a training corpus         for training.

In any of the above solutions, preferably, a method of the training comprises:

-   -   step A: initializing each patent document id and all the lexical         items to form a K-dimensional vector;     -   step B: inputting the K-dimensional vector and the word vectors         into a model, and accumulating these vectors by a hidden layer         to obtain an intermediate vector as an input of an output layer         softmax.

In any of the above solutions, preferably, formulae of the training are

f_(t) = σ_(g)(W_(f)x_(t) + U_(f)h_(t − 1) + b_(f)) i_(t) = σ_(g)(W_(i)x_(t) + U_(i)h_(t − 1) + b_(i)) o_(t) = σ_(g)(W_(o)x_(t) + U_(o)h_(t − 1) + b_(o)) c_(t) = f_(t) ∘ c_(t − 1) + i_(t) ∘ σ_(c)(W_(c)x_(t) + U_(c)h_(t − 1) + b_(c)) h_(t) = o_(t) ∘ σ_(h)(c_(t)) wherein, f represents a forgotten activation vector, σ_(g) is a sigmoid function, W, U and b are weight matrixes and deviation vector parameters that need to be learned during the training, x is an input vector of LSTM unit, t represents a time step, h represents an output vector of the LSTM unit, and i represents an activation vector of an input gate; o represents an activation vector of an output gate, c represents a cell state vector, σ_(c) and σ_(h) are hyperbolic tangent functions.

In any of the above solutions, preferably, an iteration formula of the TextRank value is

${{WS}\left( V_{i} \right)} = {\left( {1 - d} \right) + {d \times {\sum\limits_{V_{k} \in {{In}{(V_{i})}}}{\frac{\omega_{ij}}{\sum_{V_{k} \in {{Out}{(V_{i})}}}\omega_{jk}}{{WS}\left( V_{j} \right)}}}}}$ wherein, V_(i) and V_(j) represent certain patents, WS(V_(i)) represents a TextRank value of the patent V_(i), d represents a damping coefficient, ln(V_(i)) represents a collection of patents which point to the patent V_(i), Out(V_(j)) represents a collection of patents which the patent V_(j) pointed to, WS(V_(j)) represents a TextRank value of the patent V_(j).

The second object of the present invention is to provide a patent evaluation system, which includes a collection module for collecting patent documents, and further includes the following modules:

-   -   a technical point generating module, configured for generating         technical points and patent-affiliated technical points;     -   a cluster generating module, configured for generating technical         clusters and patent-affiliated clusters;     -   a patent evaluation module, configured for performing a patent         evaluation in each of the technical clusters.

In any of the above solutions, preferably, work of the technical point generating module comprises the following sub-steps:

-   -   step 11: constructing a collection of patent documents;     -   step 12: generating lexical items of each patent;     -   step 13: summarizing the lexical items and calculating a word         vector of each of the lexical items;     -   step 14: determining a word vector of a node in an existing         knowledge graph according to word vectors, and calculating a         similarity between connected word vectors to generate an         undirected weighted graph G;     -   step 15: using spectral clustering to generate clusters which         are the technical points according to the undirected weighted         graph G;     -   step 16: calculating an average word vector of each technical         point according to the lexical items and the word vectors;     -   step 17: selecting the most frequent T numbers of lexical items         from the lexical items as patent keywords, and using the word         vectors to calculate an average word vector of each patent         keyword;     -   step 18: calculating a cosine similarity between the average         word vector of the technical point and the average word vector         of the patent keyword.

In any of the above solutions, preferably, an implementation method of the step 12 is to define the collection of patent documents as C={C₁, C₂, . . . , C_(n)}, any patent Ci in the collection of patent documents C is represented by a space vector of a set of keywords.

In any of the above solutions, preferably, a process of the implementation method is to first use an existing word segmentation system to perform Chinese word segmentation on all the patent documents to obtain the lexical items; and then to remove stop words in the patent documents according to a custom or public stop word database, wherein the stop words are function words without actual meanings.

In any of the above solutions, preferably, an implementation method of the step 13 is to predict an occurrence probability of a current word according to words in context, and a learning goal is to maximize a log-likelihood function,

$L = {\sum\limits_{\omega \in C}{\log\;{p\left( \omega \middle| {{Context}\;(\omega)} \right)}}}$ wherein ω represents any word in the patent documents C, p represents probability, p(ω|Context(ω)) represents probability under the Context(ω), and Context represents a context of the word.

In any of the above solutions, preferably, characterized in that, an iteration formula of the word vector of each word is as follow:

${{v\left( \overset{\sim}{\omega} \right)}:={{v\left( \overset{\sim}{\omega} \right)} + {\eta{\sum\limits_{j = 2}^{l^{\omega}}\frac{\partial{L\left( {\omega,j} \right)}}{\partial x_{\omega}}}}}},{\overset{\sim}{\omega} \in {{Context}\mspace{11mu}(\omega)}}$ wherein x represents a word vector added by all of the word vectors of the word in the context, η represents a learning rate, l^(ω) represents the number of nodes, ∂ represents a partial derivative, x_(ω) represents an input of an input layer.

In any of the above solutions, preferably, the step 14 further comprises calculating a cosine similarity between connected nodes.

In any of the above solutions, preferably, a calculation formula of the cosine similarity is

${\cos(\theta)} = \frac{\sum_{i = 1}^{n}\left( {x_{i} \times y_{i}} \right)}{\sqrt{\sum_{i = 1}^{n}\left( x_{i} \right)^{2}} \times \sqrt{\sum_{i = 1}^{n}\left( y_{i} \right)^{2}}}$ wherein x_(i), y_(i) are the i-th element of two word vectors respectively, and n is a dimension of the word vector.

In any of the above solutions, preferably, a calculation method of the technical points is as follows:

-   -   step 151: generating an adjacency matrix W of the graph G, where         W is a symmetric matrix, and diagonal elements are 0;     -   step 152: normalizing to generate a Laplacian matrix;     -   step 153: generating the smallest k eigenvalues and         corresponding eigenvectors of L;     -   step 154: taking each row of the eigenvectors as a sample point,         and clustering the sample point by using the k-means method to         obtain cluster divisions.

In any of the above solutions, preferably, the Laplacian matrix L=D−W satisfies

$L_{ij} = \left\{ \begin{matrix} {\sum\limits_{j = 1}^{n}\omega_{ij}} & {i = j} \\ {- \omega_{ij}} & {i \neq j} \end{matrix} \right.$ wherein D is a diagonal matrix whose diagonal elements d_(i) are a sum of elements of W rows or columns, L_(ij) is an element in L, ω_(ij) is an element in W.

In any of the above solutions, preferably, work of the cluster generating module comprises the following sub-steps:

-   -   step 21: counting the number of patents in common between any         two technical points;     -   step 22: generating a complex network by taking the technical         point as a point and the number of patents in common as an edge;     -   step 23: generating the technical clusters.

In any of the above solutions, preferably, work of the patent evaluation module comprises the following sub-steps:

-   -   step 31: segmenting each patent text in the clusters and         removing the stop words;     -   step 32: generating the word vectors of each patent;     -   step 33: using the cosine similarity to calculate a similarity         between any two patents in the clusters;     -   step 34: generating a complex network by taking the patent as a         point and the similarity as an edge;     -   step 35: calculating a TextRank value of each patent.

In any of the above solutions, preferably, the step 32 comprises the following sub-steps:

-   -   step 321: generating lexical items of each patent;     -   step 322: summarizing the lexical items, and calculating the         word vector of each lexical item;     -   step 323: introducing patent documents id into a training corpus         for training.

In any of the above solutions, preferably, a method of the training comprises:

-   -   step A: initializing each patent document id and all the lexical         items to form a K-dimensional vector;     -   step B: inputting the K-dimensional vector and the word vectors         into a model, and accumulating these vectors by a hidden layer         to obtain an intermediate vector as an input of an output layer         softmax.

In any of the above solutions, preferably, formulae of the training are

f_(t) = σ_(g)(W_(f)x_(t) + U_(f)h_(t − 1) + b_(f)) i_(t) = σ_(g)(W_(i)x_(t) + U_(i)h_(t − 1) + b_(i)) o_(t) = σ_(g)(W_(o)x_(t) + U_(o)h_(t − 1) + b_(o)) c_(t) = f_(t) ∘ c_(t − 1) + i_(t) ∘ σ_(c)(W_(c)x_(t) + U_(c)h_(t − 1) + b_(c)) h_(t) = o_(t) ∘ σ_(h)(c_(t)) wherein, f represents a forgotten activation vector, σ_(g) is a sigmoid function, W, U and b are weight matrixes and deviation vector parameters that need to be learned during the training, x is an input vector of LSTM unit, t represents a time step, h represents an output vector of the LSTM unit, and i represents an activation vector of an input gate; o represents an activation vector of an output gate, c represents a cell state vector, σ_(c) and σ_(h) are hyperbolic tangent functions.

In any of the above solutions, preferably, an iteration formula of the TextRank value is

${{WS}\left( V_{i} \right)} = {\left( {1 - d} \right) + {d \times {\sum\limits_{V_{k} \in {{In}{(V_{i})}}}{\frac{\omega_{ij}}{\sum_{V_{k} \in {{Out}{(V_{i})}}}\omega_{jk}}{{WS}\left( V_{j} \right)}}}}}$ wherein, V_(i) and V_(j) represent certain patents, WS(V_(i)) represents a TextRank value of the patent V_(i), d represents a damping coefficient, ln(V_(i)) represents a collection of patents which point to the patent V_(i), Out(V_(j)) represents a collection of patents which the patent V_(j) pointed to, WS(V_(j)) represents a TextRank value of the patent V_(j).

The present invention proposes a patent evaluation method and system, which compares patents with technologies in the global same industry, can objectively evaluate the depth and breadth of patented technologies, and predict the expected life of patents, and judge the strength of R&D personnel.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a flowchart of a preferred embodiment of the patent evaluation method according to the present invention.

FIG. 1A is a flowchart of a technical point generating method of the embodiment shown in FIG. 1 of the patent evaluation method according to the present invention.

FIG. 1B is a flowchart of a technical point calculation method of the embodiment shown in FIG. 1 of the patent evaluation method according to the present invention.

FIG. 1C is a flowchart of a technical cluster generating method of the embodiment shown in FIG. 1 of the patent evaluation method according to the present invention.

FIG. 1D is a flowchart of a patent evaluation method of the embodiment shown in FIG. 1 of the patent evaluation method according to the present invention.

FIG. 1E is a flowchart of a patent word vector generating method of the embodiment shown in FIG. 1 of the patent evaluation method according to the present invention.

FIG. 2 is a block diagram of a preferred embodiment of the patent evaluation system according to the present invention.

FIG. 3 is a flowchart of another preferred embodiment of the patent evaluation method according to the present invention.

DETAILED DESCRIPTION OF THE EMBODIMENTS

The present invention will be further described below in conjunction with the drawings and specific embodiments.

Embodiment 1

As shown in FIG. 1 and FIG. 2 , step 100 is executed, and a collection module 200 collects patent documents.

Step 110 is executed. A technical point generating module 210 generates technical points and patent-affiliated technical points. As shown in FIG. 1A, step 1110 is executed, a collection of patent documents is constructed. Step 1120 is executed, lexical items of each patent is generated, the collection of patent documents is defined as C={C₁, C₂, . . . , C_(n)}, any patent Ci in the collection of patent documents C is represented by space vectors of a set of keywords. First, an existing word segmentation system is used to perform Chinese word segmentation on all the patent documents to obtain the lexical items; and then to remove stop words in the patent documents according to a custom or public stop word database, wherein the stop words are function words without actual meanings. Step 1130 is executed, the lexical items are summarized and a word vector of each lexical item is calculated, and an occurrence probability of a current word is predicted according to words in context. A learning goal is to maximize the log-likelihood function,

$L = {\sum\limits_{\omega \in C}{\log\mspace{11mu}{p\left( \omega \middle| {{Context}(\omega)} \right)}}}$ wherein ω represents any word in the patent documents C, p represents probability, p(ω|Context(ω)) represents probability under the Context(ω), and Context represents a context of the word. An iteration formula of the word vector of each word is as follows:

${{v\left( \overset{\sim}{\omega} \right)}:={{v\left( \overset{\sim}{\omega} \right)} + {\eta{\sum\limits_{j = 2}^{l^{\omega}}\frac{\partial{L\left( {\omega,j} \right)}}{\partial x_{\omega}}}}}},{\overset{\sim}{\omega} \in {{Context}\;(\omega)}}$ wherein x represents a word vector added by all of the word vectors of the word in the context, η represents a learning rate, l^(ω) represents the number of nodes, ∂ represents a partial derivative, x_(ω) represents an input of an input layer. Step 1140 is executed to determine a word vector of a node in an existing knowledge graph according to the word vectors, and to calculate a similarity between connected word vectors to generate an undirected weighted graph G, and calculate a cosine similarity between connected nodes. A calculation formula of the cosine similarity is

${\cos(\theta)} = \frac{\sum_{i = 1}^{n}\left( {x_{i} \times y_{i}} \right)}{\sqrt{\sum_{i = 1}^{n}\left( x_{i} \right)^{2}} \times \sqrt{\sum_{i = 1}^{n}\left( y_{i} \right)^{2}}}$ wherein x_(i), y_(i) are the i-th element of the two word vectors respectively, and n is a dimension of the word vector. Step 1150 is executed to use spectral clustering to generate clusters which are the technical points according to the undirected weighted graph G. As shown in FIG. 1B, a calculation method of the technical point is to execute step 1151 to generate an adjacency matrix W of the graph G, where W is a symmetric matrix, and diagonal elements are 0. Step 1152 is executed to implement a normalization to generate a Laplacian matrix; the Laplacian matrix L=D−W satisfies

$L_{ij} = \left\{ \begin{matrix} {\sum\limits_{j = 1}^{n}\omega_{ij}} & {i = j} \\ {- \omega_{ij}} & {i \neq j} \end{matrix} \right.$ wherein D is a diagonal matrix whose diagonal elements d_(i) are a sum of elements of W rows or columns, L_(ij) is an element in L, ω_(ij) is an element in W. Step 1153 is executed to generate the smallest k eigenvalues and corresponding eigenvectors of L. Step 1154 is executed to take each row of the eigenvectors as a sample point and cluster the sample point by using the k-means method to obtain cluster divisions. Step 1160 is executed to calculate an average word vector of each technical point according to the lexical items and the word vectors. Step 1170 is executed to select the most frequent T numbers of lexical items from the lexical items as patent keywords, and use the word vectors to calculate an average word vector of each patent keyword. Step 1180 is executed to calculate a cosine similarity between the average word vector of the technical point and the average word vector of the patent keyword.

Step 120 is executed, and a cluster generating module 220 generates technical clusters and patent-affiliated clusters. As shown in FIG. 1C, step 1210 is executed to count the number of patents in common between any two technical points. Step 1220 is executed to generate a complex network by taking the technical point as a point and the number of patents in common as an edge. Step 1230 is executed to generate the technical clusters. In the step 120, the same method as in the step 110 will not be discussed separately.

Step 130 is executed, and a patent evaluation module 230 performs patent evaluation in each of the technical clusters. As shown in FIG. 1D, step 1310 is executed to segment each patent text in the clusters and remove the stop words. As shown in FIG. 1E, step 1321 is executed to generate lexical items of each patent. Step 1322 is executed to summarize the lexical items, and calculate the word vector of each lexical item. Step 1323 is executed to introduce patent documents id into a training corpus for training. A method of the training includes: step A: initializing each patent document id and all the lexical items to form a K-dimensional vector−; step B: inputting the K-dimensional vector and the word vectors into a model, and accumulating these vectors by a hidden layer to obtain an intermediate vector as an input of an output layer softmax. Formulae of the training are

f_(t) = σ_(g)(W_(f)x_(t) + U_(f)h_(t − 1) + b_(f)) i_(t) = σ_(g)(W_(i)x_(t) + U_(i)h_(t − 1) + b_(i)) o_(t) = σ_(g)(W_(o)x_(t) + U_(o)h_(t − 1) + b_(o)) c_(t) = f_(t) ∘ c_(t − 1) + i_(t) ∘ σ_(c)(W_(c)t_(t) + U_(c)h_(t − 1) + b_(c)) h_(t) = o_(t) ∘ σ_(h)(c_(t)) wherein, f represents a forgotten activation vector, σ_(g) is a sigmoid function, W, U and b are weight matrixes and deviation vector parameters that need to be learned during the training, x is an input vector of LSTM unit, t represents a time step, h represents an output vector of the LSTM unit, and i represents an activation vector of an input gate; o represents an activation vector of an output gate, c represents a cell state vector, σ_(c) and σ_(h) are hyperbolic tangent functions. Step 1320 is executed to generate the word vector of each patent. Step 1330 is executed to use the cosine similarity to calculate a similarity between any two patents in the clusters. Step 1340 is executed to generate a complex network by taking the patent as a point and the similarity as an edge. Step 1350 is executed to calculate a TextRank value of each patent. An iteration formula of the TextRank value is

${{WS}\left( V_{i} \right)} = {\left( {1 - d} \right) + {d \times {\sum\limits_{V_{k} \in {{In}{(V_{i})}}}{\frac{\omega_{ij}}{\sum_{V_{k} \in {{i{Out}}{(V_{j})}}}\omega_{jk}}{{WS}\left( V_{j} \right)}}}}}$ wherein, V_(i) and V_(j) represent certain patents, WS(V_(i)) represents a TextRank value of the patent V_(i), d represents a damping coefficient, ln(V_(i)) represents a collection of patents which point to the patent V_(i), Out(V_(j)) represents a collection of patents which the patent V_(j) pointed to, WS(V_(j)) represents a TextRank value of the patent V_(j). In the step 130, the same method as in the step 110 will not be discussed separately.

Embodiment 2

The advantages of the present invention are:

-   -   1. Get rid of the dependence on experts' evaluation samples, and         have higher efficiency and lower cost.     -   2. The mining of patent information has risen from quantitative         statistics to the information contained in text. Most of the         information on patented technical attributes is expressed in         text form, and the source of information is closer to the         essence of patents.     -   3. Through technical clusters, patents with similar technologies         are put together for evaluation. On the one hand, unnecessary         calculations are reduced, and on the other hand, it is easier to         dig out the advantages and disadvantages of technologies         relative to similar technologies.

As shown in FIG. 3 , the first step is to generate technical points and patent-affiliated technical points.

Step 1: collecting patent documents and constructing a collection of patent documents;

Step 2: generating lexical items of each patent. A specific implementation method is to define the collection of patent documents as C={C₁, C₂, . . . , C_(n)}, any patent Ci in the collection of patent documents C is represented by a space vector of a set of keywords; a process of the implementation method is to first use an existing word segmentation system to perform Chinese word segmentation on all the patent documents to obtain the lexical items; and then to remove stop words in the patent documents according to a custom or public stop word database, wherein the stop words are function words without actual meanings.

Step 3: summarizing the lexical items generated in step the 2 and calculating a word vector of each of the lexical items. A specific implementation method is CBOW of word2vec, which predicts an occurrence probability of a current word according to words in context.

The learning goal is to maximize the log likelihood function:

$L = {\sum\limits_{\omega \in C}{\log\mspace{11mu}{p\left( \omega \middle| {{Context}(\omega)} \right)}}}$ wherein ω represents any word in the patent documents C, p represents probability, p(ω|Context(ω)) represents probability under the Context(ω), and Context represents a context of the word.

A Hierarchical Softmax method is used, an iteration formula of the word vector of each word is as follows:

${{v\left( \overset{\sim}{\omega} \right)}:={{v\left( \overset{\sim}{\omega} \right)} + {\eta{\sum\limits_{j = 2}^{l^{\omega}}\frac{\partial{L\left( {\omega,j} \right)}}{\partial x_{\omega}}}}}},{\overset{\sim}{\omega} \in {{Context}\;(\omega)}}$ wherein x represents a word vector added by all of the word vectors of the word in the context, η represents a learning rate, l^(ω) represents the number of nodes, ∂ represents a partial derivative, x_(ω) represents an input of an input layer.

Step 4: using the word vectors calculated in the step 3 to determine a word vector of a node (words are nodes) in an existing knowledge graph (if a word does not appear in step 2, the node is deleted), and calculate a cosine similarity between connected nodes, a calculation formula of the cosine similarity is

${\cos(\theta)} = \frac{\sum_{i = 1}^{n}\left( {x_{i} \times y_{i}} \right)}{\sqrt{\sum_{i = 1}^{n}\left( x_{i} \right)^{2}} \times \sqrt{\sum_{i = 1}^{n}\left( y_{i} \right)^{2}}}$ wherein x_(i), y_(i) are the i-th element of the two word vectors respectively, and n is a dimension of the word vector.

Step 5: according to an undirected weighted graph G generated in the step 4, using spectral clustering to generate clusters (collection of points) which are the technical points. The calculation method is as follows:

-   -   1. generating an adjacency matrix W of the graph G, where W is a         symmetric matrix, and diagonal elements are 0;     -   2. normalizing to generate a Laplacian matrix; the Laplacian         matrix L=D−W satisfies

$L_{ij} = \left\{ \begin{matrix} {\underset{j = 1}{\sum\limits^{n}}\omega_{ij}} & {i = j} \\ {- \omega_{ij}} & {i \neq j} \end{matrix} \right.$ wherein D is a diagonal matrix whose diagonal elements d_(i) are a sum of elements of W rows or columns, L_(ij) is an element in L, ω_(ij) is an element in W.

-   -   3. generating the smallest k eigenvalues and corresponding         eigenvectors of L;     -   4. taking each row of the eigenvectors as a sample point, and         clustering the sample point by using the k-means method to         obtain cluster divisions.

Step 6: using words of the technical points obtained in the step 5 and the word vectors obtained in the step 3 to obtain an average value of word vectors of each technical point.

Step 7: selecting the most frequent 5 lexical items from the lexical items of each patent obtained in the step 2 as patent keywords, and using the word vectors obtained in the step 3 to calculate an average word vector of each patent keyword.

Step 8: calculating a cosine similarity between the average word vector of the technical point obtained in the step 6 and the average word vector of the patent keyword obtained in the step 7, and determining the patent-affiliated technical points with a combination that exceeds a threshold.

The second step is to generate technical clusters and patent-affiliated clusters.

-   -   Step 1: counting the number of patents in common between any two         technical points;     -   step 2: generating a complex network by taking the technical         point as a point and the number of patents in common as an edge;     -   step 3: generating the technical clusters.

The third step is to perform a patent evaluation in each of the technical clusters.

-   -   Step 1: segmenting each patent text in the clusters and removing         the stop words;     -   step 2: generating the word vectors of each patent;     -   step 3: using the cosine similarity to calculate a similarity         between any two patents in the clusters;     -   step 4: generating a complex network by taking the patent as a         point and the similarity as an edge;     -   step 5: calculating a TextRank value of each patent.

Doc2vec:

A Distributed Memory version of Paragraph Vector (PV-DM) method is used to try to predict a probability of a word under the given context and paragraph vector.

A training method is similar to the CBOW in the first step-step 3, words obtained in the first step-step 2 and the vector obtained in the first step-step 3 are used, and then the patent documents id are introduced into the training corpus for training. First, each document ID and all the words obtained in the first step-step 2 are initialized to form a K-dimensional vector−, and then the document vector and the vector obtained in the first step-step 3 are inputted into a model, and a hidden layer accumulates these vectors to get an intermediate vector which is used as an input of the softmax of an output layer.

Doc2vec can also be replaced by a backward propagation of LSTM, formulae are

f_(t) = σ_(g)(W_(f)x_(t) + U_(f)h_(t − 1) + b_(f)) i_(t) = σ_(g)(W_(i)x_(t) + U_(i)h_(t − 1) + b_(i)) o_(t) = σ_(g)(W_(o)x_(t) + U_(o)h_(t − 1) + b_(o)) c_(t) = f_(t) ∘ c_(t − 1) + i_(t) ∘ σ_(c)(W_(c)t_(t) + U_(c)h_(t − 1) + b_(c)) h_(t) = o_(t) ∘ σ_(h)(c_(t)) wherein, f represents a forgotten activation vector, σ_(g) is a sigmoid function, W, U and b are weight matrixes and deviation vector parameters that need to be learned during the training, x is an input vector of LSTM unit, t represents a time step, h represents an output vector of the LSTM unit, and i represents an activation vector of an input gate; o represents an activation vector of an output gate, c represents a cell state vector, σ_(c) and σ_(h) are hyperbolic tangent functions.

TextRank (TR):

An iteration formula is as follows:

${{WS}\left( V_{i} \right)} = {\left( {1 - d} \right) + {d \times {\sum\limits_{V_{k} \in {{In}{(V_{i})}}}{\frac{\omega_{ij}}{\sum_{V_{k} \in {{i{Out}}{(V_{j})}}}\omega_{jk}}{{WS}\left( V_{j} \right)}}}}}$ wherein, V_(i) and V_(j) represent certain patents, WS(V_(i)) represents a TextRank value of the patent V_(i), d represents a damping coefficient, ln(V_(i)) represents a collection of patents which point to the patent V_(i), Out(V_(j)) represents a collection of patents which the patent V_(j) pointed to, WS(V_(i)) represents a TextRank value of the patent V_(j).

In order to better understand the present invention, the detailed description is made above in conjunction with the specific embodiments of the present invention, but it is not a limitation of the present invention. Any simple modification to the above embodiments based on the technical essence of the present invention still belongs to the scope of the technical solution of the present invention. Each embodiment in this specification focuses on differences from other embodiments, and the same or similar parts between the various embodiments can be referred to each other. As for the system embodiment, since it basically corresponds to the method embodiment, the description is relatively simple, and the relevant part can refer to the part of the description of the method embodiment. 

What is claimed is:
 1. A patent evaluation method, comprising collecting patent documents, further comprising: step 1: generating technical points and patent-affiliated technical points; step 2: generating technical clusters and patent-affiliated clusters; step 3: performing a patent evaluation in each of the technical clusters; wherein the step 1 comprises the following sub-steps: step 11: constructing a collection of the patent documents; step 12: generating lexical items of each patent of the collection; step 13: summarizing the lexical items and calculating word vectors of the lexical items; step 14: determining a word vector of a node in an existing knowledge graph according to the word vectors of the lexical items, and calculating a similarity between connected word vectors to generate an undirected weighted graph G; step 15: using spectral clustering to generate clusters according to the undirected weighted graph G, wherein the clusters are the technical points; step 16: calculating an average word vector of each of the technical points according to the lexical items and the word vectors of the lexical items; step 17: selecting the most frequent T numbers of lexical items from the lexical items as patent keywords, and using the word vectors to calculate an average word vector of each of the patent keywords; and step 18: calculating a cosine similarity between the average word vector of each of the technical points and the average word vector of each of the patent keywords.
 2. The patent evaluation method according to claim 1, wherein an implementation method of the step 12 is to define the collection of the patent documents as C={C₁, C₂, . . . , C_(n)}, and a patent C_(i) in the collection of the patent documents C is represented by a space vector of a set of the patent keywords; a process of the implementation method is to first use an existing word segmentation system to perform Chinese word segmentation on the patent documents to obtain the lexical items; and then to remove stop words in the patent documents according to a custom or public stop word database, wherein the stop words are function words without actual meanings.
 3. The patent evaluation method according to claim 2, wherein an implementation method of the step 13 is to predict an occurrence probability of a current word according to words in a context, and a learning goal is to maximize a log-likelihood function, $L = {\sum\limits_{\omega \in C}{\log\mspace{11mu}{p\left( \omega \middle| {{Context}\;(\omega)} \right)}}}$ wherein ω represents a word in the collection of the patent documents C, p represents the occurrence probability, p(ω|Context(ω)) represents a probability under the Context(ω), and Context represents a context of the word; an iteration formula of the word vector of each word is as follows: ${{v\left( \overset{\sim}{\omega} \right)}:={{v\left( \overset{\sim}{\omega} \right)} + {\eta{\sum\limits_{j = 2}^{l^{\omega}}\frac{\partial{L\left( {\omega,j} \right)}}{\partial x_{\omega}}}}}},{\overset{\sim}{\omega} \in {{Context}(\omega)}}$ wherein x represents a word vector added by word vectors of the words in the context, η represents a learning rate, l^(ω) represents a number of nodes, ∂ represents a partial derivative, x_(ω) represents an input of an input layer.
 4. The patent evaluation method according to claim 3, wherein the step 14 further comprises calculating a cosine similarity between connected nodes, a calculation formula of the cosine similarity between the connected nodes is ${\cos(\theta)} = \frac{\sum_{i = 1}^{n}\left( {x_{i} \times y_{i}} \right)}{\sqrt{\sum_{i = 1}^{n}\left( x_{i} \right)^{2}} \times \sqrt{\sum_{i = 1}^{n}\left( y_{i} \right)^{2}}}$ wherein x_(i), y_(i) are i-th elements of two word vectors respectively, and n is a dimension of the two word vectors.
 5. The patent evaluation method according to claim 4, wherein a calculation method of the technical points is as follows: step 151: generating an adjacency matrix W of the undirected weighted graph G, wherein the W is a symmetric matrix, and diagonal elements of the W are 0; step 152: normalizing the adjacency matrix W to generate a Laplacian matrix L; step 153: generating smallest k eigenvalues and corresponding eigenvectors of the Laplacian matrix L; step 154: taking each row of the eigenvectors as a sample point, and clustering the sample point by using a k-means method to obtain cluster divisions; the Laplacian matrix L=D−W satisfies $L_{ij} = \left\{ \begin{matrix} {\sum\limits_{j = 1}^{n}\omega_{ij}} & {i = j} \\ {- \omega_{ij}} & {i \neq j} \end{matrix} \right.$ wherein D is a diagonal matrix, and diagonal elements d_(i) of the diagonal matrix D are a sum of elements of W rows or columns, L_(ij) is an element in the L, ω_(ij) is an element in the W.
 6. The patent evaluation method according to claim 5, wherein the step 2 comprises the following sub-steps: step 21: counting a number of patents in common between two technical points of the technical points; step 22: generating a first complex network by taking the technical point as a point and the number of patents in common as an edge; step 23: generating the technical clusters.
 7. The patent evaluation method according to claim 6, wherein the step 3 comprises the following sub-steps: step 31: segmenting each patent text in the technical clusters and removing the stop words; step 32: generating word vectors of each patent; step 33: using a cosine similarity to calculate a similarity between two patents in the technical clusters; step 34: generating a second complex network by taking the each patent as a point and the similarity as an edge; step 35: calculating a TextRank value of the each patent; the step 32 comprises the following sub-steps: step 321: generating lexical items of each patent; step 322: summarizing the lexical items, and calculating word vectors of the lexical items; step 323: introducing an id of each patent document of the patent documents into a training corpus for training; a method of the training comprises: step A: initializing the id of the each patent document and the lexical items to form a K-dimensional vector; step B: inputting the K-dimensional vector and the word vectors into a model, and accumulating the K-dimensional vector and the word vectors by a hidden layer to obtain an intermediate vector as an input of an output layer softmax; formulae of the training are f_(t) = σ_(g)(W_(f)x_(t) + U_(f)h_(t − 1) + b_(f)) i_(t) = σ_(g)(W_(i)x_(t) + U_(i)h_(t − 1) + b_(i)) o_(t) = σ_(g)(W_(o)x_(t) + U_(o)h_(t − 1) + b_(o)) c_(t) = f_(t) ∘ c_(t − 1) + i_(t) ∘ σ_(c)(W_(c)x_(t) + U_(c)h_(t − 1) + b_(c)) h_(t) = o_(t) ∘ σ_(h)(c_(t)) wherein, f represents a forgotten activation vector, σg is a sigmoid function, W, U and b are weight matrices and deviation vector parameters to be learned during the training, x is an input vector of a long short-term memory (LSTM) unit, t represents a time step, h represents an output vector of the LSTM unit, and i represents an activation vector of an input gate; o represents an activation vector of an output gate, c represents a cell state vector, σ_(c) and σ_(h) are hyperbolic tangent functions; an iteration formula of the TextRank value is ${{WS}\left( V_{i} \right)} = {\left( {1 - d} \right) + {d \times {\sum\limits_{V_{k} \in {{In}{(V_{i})}}}{\frac{\omega_{ij}}{\sum_{V_{k} \in {{Out}{(V_{i})}}}\omega_{jk}}{{WS}\left( V_{j} \right)}}}}}$ wherein, V_(i) and V_(j) represent predetermined patents, WS(V_(i)) represents a TextRank value of the patent V_(i), d represents a damping coefficient, In(V_(i)) represents a collection of patents pointing to the patent V_(i), Out(V_(j)) represents a collection of patents which the patent V_(j) pointed to, WS(V_(j)) represents a TextRank value of the patent V_(j). 